Enumeration of optimal pin-jointed bistable compliant mechanisms with non-crossing members
نویسندگان
چکیده
منابع مشابه
Enumeration of Optimal Pin-Jointed Bistable Compliant Mechanisms with Non-Crossing Members
An optimization approach is presented for enumerating pin-jointed bistable compliant mechanisms. In the first stage, the statically determinate trusses with non-crossing members containing a given set of nodes and some pre-defined members are regarded as minimally rigid framework or a Laman framework, and are enumerated without repetitions by the graph enumeration algorithm. In the second stage...
متن کاملEnumeration of Optimal Pin-Jointed Bistable Compliant Mechanisms
Recently, a new type of mechanism called compliant mechanism has been developed and applied mainly in the field of micro-mechanics. A compliant mechanism has flexible parts to stabilize the structure, which is contrary to the conventional unstable mechanism. Although a compliant mechanism is usually modeled as a continuum with elastic joints, it is possible to generate the similar mechanism by ...
متن کاملEnumeration of Pin-Permutations
In this paper, we study the class of pin-permutations, that is to say of permutations having a pin representation. This class has been recently introduced in [16], where it is used to find properties (algebraicity of the generating function, decidability of membership) of classes of permutations, depending on the simple permutations this class contains. We give a recursive characterization of t...
متن کاملEnumeration of non-crossing pairings on bit strings
A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings 1101 . . . 1r0r , we generalize classical problems from the theory of Catalan structures. In particular, it is very difficult to find useful explicit formulas for the enumeration function φ(n1, m1, . . . , nr, mr), which count...
متن کاملAsymptotic enumeration of non-crossing partitions on surfaces
We generalize the notion of non-crossing partition on a disk to general surfaces with boundary. For this, we consider a surface Σ and introduce the number CΣ(n) of noncrossing partitions of a set of n points laying on the boundary of Σ. Our main result is an asymptotic estimate for CΣ(n). The proofs use bijective techniques arising from map enumeration, joint with the symbolic method and singul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Structural and Multidisciplinary Optimization
سال: 2008
ISSN: 1615-147X,1615-1488
DOI: 10.1007/s00158-008-0258-z